Open answer set programming for the semantic web
نویسندگان
چکیده
منابع مشابه
Open answer set programming for the semantic web
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guarding knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting extended forest logic programs (EFoLPs) can be reduced to finite answer set programming, for which reaso...
متن کاملAnswer Set Programming for the Semantic Web
This thesis makes a contribution to the research e orts of integrating rule-based inference methods with current knowledge representation formalisms in the Semantic Web. Ontology languages such as OWL and RDF Schema seem to be widely accepted and successfully used for semantically enriching knowledge on the Web and thus prepare it for machinereadability. However, these languages are of restrict...
متن کاملA Framework for Distributed Reasoning on the Semantic Web Based on Open Answer Set Programming
The Semantic Web envisions a Web where information is represented by means of formal vocabularies called ontologies for enabling automatic processing and retrieval of information. It is expected that ontologies will be interconnected by mappings forming a network topology. Reasoning with such a network of ontologies is a big challenge due to scalability issues. The local model semantics seems t...
متن کاملReasoning about the Semantic Web using Answer Set Programming
The paper discusses some innovative aspects related to the integration of a framework based on Answer Set Programming in an Information Retrieval Agent, namely, the Global Search Agent. In order to improve the original system effectiveness, the GSA2 system introduces a new internal architecture based on a message-passing framework and on an ontology description formalism (WOLF, Web OntoLogy Fra...
متن کاملGuarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a fixed point logic (FPL) extension of Clark’s completion such that open answer sets correspond to models of FPL formulas and identify a syntactic subclass of programs, called (loosely) guarded programs. Whereas reasoning wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2007
ISSN: 1570-8683
DOI: 10.1016/j.jal.2006.02.001